Neighborhood Matchmaker Method: A Decentralized Optimization Algorithm for Personal Human Network
نویسندگان
چکیده
In this paper, we propose an algorithm called Neighborhood Matchmaker Method to optimize personal human networks. Personal human network is useful for various utilization of information like information gathering, but it is usually formed locally and often independently. In order to adapt various needs for information utilization, it is necessary to extend and optimize it. Using the neighborhood matchmaker method, we can increase a new friend who is expected to share interests via all own neighborhoods on the personal human network. Iteration of matchmaking is used to optimize personal human networks. We simulate the neighborhood matchmaker method with the practical data and the random data and compare the results by our method with those by the central server model. The neighborhood matchmaker method can reach almost the same results obtained by the sever model with each type of data.
منابع مشابه
Proposal of Decentralized Information Sharing System using Local Matchmaking
In this paper, we propose a re-configuration method for personal human network and show the information sharing system using it. Personal human network is useful for various utilization of information like information gathering. Since a personal network is usually ad-hoc network, it is necessary to extend and optimize it. Using the neighborhood matchmaker method, we can increase a new friend wh...
متن کاملFind better friends ? - Re - configuration of personal networks by the neighborhood matchmaker method -
In this paper, we propose Neighborhood Matchmaker Method as a re-configration method for personal human network. Personal human network is important to realize the Semantic web because trust should be obtained and used with the personal network. Since a persnal network is usually adhoc network, it is necessary to extend and optimize it. Using the neighborhood matchmaker model, we can increase a...
متن کاملA multiple criteria algorithm for planning the itinerary of mobile sink in wireless sensor networks
The mobile sink can increase the efficiency of wireless sensor networks. It moves in a monitored environment and collects the network nodes information. Thus, by the sink we can balance the power consumption and increases the network lifetime. Determining path of the sink's movement is usually modeled as an optimization problem where finding optimal solutions require collecting value of all the...
متن کاملOptimizing decentralized production–distribution planning problem in a multi-period supply chain network under uncertainty
Decentralized supply chain management is found to be significantly relevant in today’s competitive markets. Production and distribution planning is posed as an important optimization problem in supply chain networks. Here, we propose a multi-period decentralized supply chain network model with uncertainty. The imprecision related to uncertain parameters like demand and price of the final produc...
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کامل